An elementary approach to component sizes in critical random graphs
نویسندگان
چکیده
Abstract In this article we introduce a simple tool to derive polynomial upper bounds for the probability of observing unusually large maximal components in some models random graphs when considered at criticality. Specifically, apply our method model intersection graph, graph obtained through p -bond percolation on general d -regular and an inhomogeneous graph.
منابع مشابه
An elementary approach to C∗-algebras associated to topological graphs
We develop notions of a representation of a topological graph E and of a covariant representation of a topological graph E which do not require the machinery of C∗-correspondences and Cuntz– Pimsner algebras. We show that the C∗-algebra generated by a universal representation of E is isomorphic to the Toeplitz algebra of Katsura’s topological-graph bimodule, and that the C∗-algebra generated by...
متن کاملOn Subgraph Sizes in Random Graphs
For a graph G with m edges let its Range of Subgraph Sizes (RSS) ρ(G) = {t : G contains a vertex-induced subgraph with t edges}. G has a full RSS if ρ(G) = {0, 1, . . . ,m}. We establish the threshold for a random graph to have a full RSS and give tight bounds on the likely RSS of a dense random graph. ∗Current Address: School of Mathematics, Georgia Institute of Technology, Atlanta GA30332 †Su...
متن کاملA Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution
Abstract. We study a point process describing the asymptotic behavior of sizes of the largest components of the random graph G(n, p) in the critical window p = n +λn. In particular, we show that this point process has a surprising rigidity. Fluctuations in the large values will be balanced by opposite fluctuations in the small values such that the sum of the values larger than a small ε is almo...
متن کاملA Probabilistic Approach to Block Sizes in Random Maps
We present a probabilistic approach to block sizes in random maps, which yields straightforward and singularity analysis-free proofs of some results of [2, 3, 7]. The proof also yields convergence in distribution of the rescaled size of the k’th largest 2-connected block in a large random map, for any fixed k ≥ 2, to a Fréchet-type extreme order statistic. This seems to be a new result even whe...
متن کاملThe Component Sizes of a Critical Random Graph with given Degree Sequence by Adrien Joseph
Consider a critical random multigraph Gn with n vertices constructed by the configuration model such that its vertex degrees are independent random variables with the same distribution ν (criticality means that the second moment of ν is finite and equals twice its first moment). We specify the scaling limits of the ordered sequence of component sizes of Gn as n tends to infinity in different ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2022
ISSN: ['1475-6072', '0021-9002']
DOI: https://doi.org/10.1017/jpr.2022.13